Least and most disjoint root sets for Daubechies wavelets
نویسنده
چکیده
A new set of wavelet filter families has been added to the systematized collection of Daubechies wavelets. This new set includes complex and real, orthogonal and biorthogonal, least and most disjoint families defined using constraints derived from the principle of separably disjoint root sets in the complex z-domain. All of the new families are considered to be constraint selected without a search and without any evaluation of filter properties such as time-domain regularity or frequency-domain selectivity. In contrast, the older families in the collection are considered to be search optimized for extremal properties. Some of the new families are demonstrated to be equivalent to some of the older families, thereby obviating the necessity for any search in their computation. A library that displays images of all filter families in the collection is available at .
منابع مشابه
Disjoint Sets of Daubechies Polynomial Roots for Generating Wavelet Filters with Extremal Properties
A new set of wavelet filter families has been added to the systematized collection of Daubechies wavelets. This new set includes complex and real, orthogonal and biorthogonal, least and most disjoint families defined using constraints derived from the principle of separably disjoint root sets in the complex z-domain. All of the new families are considered to be constraint selected without a sea...
متن کاملComputational Algorithms for Daubechies Least-Asymmetric, Symmetric, and Most-Symmetric Wavelets
Computational algorithms have been developed for generating min-length max-flat FIR filter coefficients for orthogonal and biorthogonal wavelets with varying degrees of asymmetry or symmetry. These algorithms are based on spectral factorization of the Daubechies polynomial with a combinatorial search of root sets selected by a desired optimization criterion. Daubechies filter families were syst...
متن کاملApplication of Daubechies wavelets for solving Kuramoto-Sivashinsky type equations
We show how Daubechies wavelets are used to solve Kuramoto-Sivashinsky type equations with periodic boundary condition. Wavelet bases are used for numerical solution of the Kuramoto-Sivashinsky type equations by Galerkin method. The numerical results in comparison with the exact solution prove the efficiency and accuracy of our method.
متن کاملOn the Distribution of Zeros for Daubechies Orthogonal Wavelets and Associated Polynomials
In the last decade, Daubechies orthogonal wavelets have been successfully used in many signal processing paradims. The construction of these wavelets via two channel perfect reconstruction filter bank requires the identification of necessary conditions that the coefficients of the filters and the roots of binomial polynomials associated with it should exhibit. In this paper, a subclass of polyn...
متن کاملConstraint-Selected and Search-Optimized Families of Daubechies Wavelet Filters Computable by Spectral Factorization
A unifying algorithm has been developed to systematize the collection of compact Daubechies wavelets computable by spectral factorization of a symmetric positive polynomial. This collection comprises all classes of real and complex orthogonal and biorthogonal wavelet filters with maximal flatness for their minimal length. The main algorithm incorporates spectral factorization of the Daubechies ...
متن کامل